Complexity Classification in Infinite-Domain Constraint Satisfaction

appeared in the proceedings of ICDT’10. [44] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. In Proceedings of CSL, pages 44–57, Vienna, 2003. [45] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation, 16(3):359–373, 2006. [46] M. Bodirsky and D. Piguet. Finite trees are Ramsey with respect to topological embeddings. Preprint, arXiv:1002.1557, 2010. [47] M. Bodirsky and M. Pinsker. Minimal functions on the random graph. Israel Journal of Mathematics. To appear. Preprint arXiv.org/abs/1003.4030. [48] M. Bodirsky and M. Pinsker. Reducts of Ramsey structures. AMS Contemporary Mathematics, vol. 558 (Model Theoretic Methods in Finite Combinatorics), pages 489–519, 2011. [49] M. Bodirsky and M. Pinsker. Schaefer’s theorem for graphs. In Proceedings of the Symposium on Theory of Computing (STOC), pages 655–664, 2011. Preprint of the long version available at arxiv.org/abs/1011.2894.